ALPS: A Framework for Implementing Parallel Search Algorithms
نویسندگان
چکیده
ALPS is a framework for implementing and parallelizing tree search algorithms. It employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained and shared during the search. Implementing such algorithms in a scalable manner is challenging both because of storage requirements and because of communications overhead incurred in the sharing of data. In this abstract, we describe the design of ALPS and how the design addresses these challenges. We present two sample applications built with ALPS and preliminary computational results.
منابع مشابه
CHiPPS: A Framework for Implementing Parallel Search Algorithms
The COIN-OR High Performance Parallel Search (CHiPPS) framework is a C++ class library for implementing and parallelizing tree search algorithms. It currently consists of a library of base classes known as the Abstract Library for Parallel Search (ALPS) and two other layers useful for implementing algorithms based on mathematical programming paradigms. Because of its general approach, however, ...
متن کاملALPS: Software Framework for Scheduling Parallel Computations with Application to Parallel Space-Time Adaptive Processing
The goal of this project is to automatically generate executable files for optimal parallel implementation of large computational tasks defined by their high-level algorithmic description. This goal is realized by a set of software tools called ALPS software framework. We present this framework in the context of a large signal processing application known as STAP. Space-Time Adaptive Processing...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کامل